Analytical Methods for Multilevel Graph-Partitioning
نویسنده
چکیده
منابع مشابه
Serial and Parallel Multilevel Graph Partitioning Using Fixed Centers
We present new serial and parallel algorithms for multilevel graph partitioning. Our algorithm has coarsening, partitioning and uncoarsening phases like other multilevel partitioning methods. However, we choose fixed nodes which are at least a specified distance away from each other and coarsen them with their neighbor nodes in the coarsening phase using various heuristics. Using this algorithm...
متن کاملAnalysis, Modeling and Simulation of Multiscale Problems Integrating Multilevel Graph Partitioning with Hierarchical Set Oriented Methods for the Analysis of Dynamical Systems
Dynamical systems from real applications are usually very complex and difficult to handle. In order to gain insight in the dominant structures of the dynamical system it is important to analyze the characteristics of the dynamical systems. Recently, the combination of hierarchical set oriented methods and of multilevel graph partitioning methods has been used for the analysis of the almost inva...
متن کاملA Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm, that is particularly suited for high latency message-passing libraries. The multilevel k-way partitioning algorithm reduces the size of the graph by collapsing vertices and edges (coarsening phase), finds a k-way partitioning of the smaller graph, and then it constructs a k-way partitioning for t...
متن کاملPartitioning Sparse Rectangular Matrices for Parallel Computations of Ax and ATv
This paper addresses the problem of partitioning the nonzeros of sparse nonsymmetric and nonsquare matrices in order to e ciently compute parallel matrix-vector and matrix-transpose-vector multiplies. Our goal is to balance the work per processor while keeping communications costs low. Although the symmetric partitioning problem has been well-studied, the nonsymmetric and rectangular cases have...
متن کاملRecent Trends in Graph Partitioning for Scienti c Computing
Graph partitioning is a widespread technique in computer science, scienti c computing, and related elds. The most common formulation of the graph partitioning problem (GPP) for an undirected graph G = (V,E) asks for a division of V into k pairwise disjoint subsets (parts) with size approximately |V|/k such that the edge cut, i.e., the total number of edges having their incident nodes in di eren...
متن کامل